#include <iostream>
#include "unorder_set.h"
#include "unorder_map.h"

int main()
{
	bit::unordered_set<int> hs;
	hs.insert(1);
	bit::unordered_map<int,int> hm;
	hm.insert(make_pair(2, 2));
	hm.insert(make_pair(3, 3));
	hm.insert(make_pair(5, 5));
	hm.insert(make_pair(6, 6));
	hm.insert(make_pair(72, 72));
	hm.insert(make_pair(11, 11));
	hm.insert(make_pair(1, 1));
	hm.insert(make_pair(22, 22));
	hm.insert(make_pair(222, 222));
	hm.insert(make_pair(33, 33));
	hm.insert(make_pair(23, 23));
	hm.insert(make_pair(27, 27));
	auto it = hm.begin();
	while (it != hm.end())
	{
		cout << it->first << " ";
		++it;
	}
	cout << endl;
	for (auto& e : hm)
	{
		cout << e.first <<":"<<e.second<< endl;
	}
	return 0;
}

